Freiman-Ruzsa-Type Theory For Small Doubling Constant
نویسنده
چکیده
In this paper, we study the linear structure of sets A ⊂ Fn2 with doubling constant σ(A) < 2, where σ(A) := |A+A| |A| . In particular, we show that A is contained in a small affine subspace. We also show that A can be covered by at most four shifts of some subspace V with |V | ≤ |A|. Finally, we classify all binary sets with small doubling constant.
منابع مشابه
An Introduction to Additive Combinatorics
This is a slightly expanded write-up of my three lectures at the Additive Combinatorics school. In the first lecture we introduce some of the basic material in Additive Combinatorics, and in the next two lectures we prove two of the key background results, the Freiman-Ruzsa theorem and Roth’s theorem for 3-term arithmetic progressions. Lecture I: Introductory material 1. Basic Definitions. 2. I...
متن کاملSumset and Inverse Sumset Theory for Shannon Entropy
Let G = (G,+) be an additive group. The sumset theory of Plünnecke and Ruzsa gives several relations between the size of sumsets A + B of finite sets A, B, and related objects such as iterated sumsets kA and difference sets A−B, while the inverse sumset theory of Freiman, Ruzsa, and others characterises those finite sets A for which A+A is small. In this paper we establish analogous results in ...
متن کاملThe Freiman-Ruzsa Theorem in Finite Fields
Let G be a finite abelian group of torsion r and let A be a subset of G. The Freiman-Ruzsa theorem asserts that if |A + A| ≤ K|A| then A is contained in a coset of a subgroup of G of size at most Kr 4 |A|. It was conjectured by Ruzsa that the subgroup size can be reduced to r for some absolute constant C ≥ 2. This conjecture was verified for r = 2 in a sequence of recent works, which have, in f...
متن کاملNotes on the Polynomial Freiman-ruzsa Conjecture
Let G be an abelian group. The Polynomial Freiman-Ruzsa conjecture (PFR) concerns the structure of sets A ⊆ G for which |A + A| 6 K|A|. These notes provide proofs for the statements made in §10 of [8], and as such constitute a reasonably detailed discussion of the PFR in the case G = F2 . Although the purpose of these notes is to furnish proofs for the statements in §10 of [8], they are reasona...
متن کاملAn Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem
The polynomial Freiman-Ruzsa conjecture is one of the most important conjectures in additive combinatorics. It asserts that one can switch between combinatorial and algebraic notions of approximate subgroups with only a polynomial loss in the underlying parameters. This conjecture has also found several applications in theoretical computer science. Recently, Tom Sanders proved a weaker version ...
متن کامل